A Scalable Sweep Algorithm for the cumulative and bin-packing constraints
نویسنده
چکیده
This paper presents a new sweep based algorithm for the cumulative constraint that combines filtering with a greedy mode. The algorithm has a worst case complexity of O(n log n) in the context of cumulative and O(n log n) in the context of bin-packing, where n is the number of tasks (items). It can handle up to 256000 tasks (items) in less than 15 minutes within a single cumulative constraint.
منابع مشابه
A Scalable Sweep Algorithm for the cumulative Constraint
This paper presents a sweep based algorithm for the cumulative constraint, which can operate in filtering mode as well as in greedy assignment mode. Given n tasks, this algorithm has a worstcase time complexity of O(n). In practice, we use a variant with better average-case complexity but worst-case complexity of O(n log n), which goes down to O(n log n) when all tasks have unit duration, i.e. ...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملSimple and Scalable Time-Table Filtering for the Cumulative Constraint
Cumulative is an essential constraint in the CP framework, and is present in scheduling and packing applications. The lightest filtering for the cumulative constraint is time-tabling. It has been improved several times over the last decade. The best known theoretical time complexity for time-table is O(n logn) introduced by Ouellet and Quimper. We show a new algorithm able to run in O(n), by re...
متن کاملA THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM
The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...
متن کاملOptimization of heterogeneous Bin packing using adaptive genetic algorithm
This research is concentrates on a very interesting work, the bin packing using hybrid genetic approach. The optimal and feasible packing of goods for transportation and distribution to various locations by satisfying the practical constraints are the key points in this project work. As the number of boxes for packing can not be predicted in advance and the boxes may not be of same category alw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012